A Semantics of Realisability for the Classical Propositional Natural Deduction

نویسندگان

  • Karim Nour
  • Khelifa Saber
چکیده

In this paper, we introduce a semantics of realisability for the classical propositional natural deduction and we prove a correctness theorem. This allows to characterize the operational behaviour of some typed terms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploring the Gap between Linear and Classical Logic

The Medial rule was first devised as a deduction rule in the Calculus of Structures. In this paper we explore it from the point of view of category theory, as additional structure on a ∗-autonomous category. This gives us some insights on the denotational semantics of classical propositional logic, and allows us to construct new models for it, based on suitable generalizations of the theory of ...

متن کامل

Informational Semantics, Non-Deterministic Matrices and Feasible Deduction

We present a unifying semantic and proof-theoretical framework for investigating depth-bounded approximations to Boolean Logic in which the number of nested applications of a single structural rule, representing the classical Principle of Bivalence (classical cut), is bounded above by a fixed natural number. These approximations provide a hierarchy of tractable logical systems that indefinitely...

متن کامل

An Intuitionistic Logic for Sequential Control

We introduce a propositional logic ICL, which adds to intuitionistic logic elements of classical reasoning without collapsing it into classical logic. This logic includes a new constant for false, which augments false in intuitionistic logic and in minimal logic. We define Kripke models for ICL and show how they translate to several other forms of semantics. We define a sequent calculus and pro...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

A New Approach to Quantum Logic

. The reason for including this chapter is to make the book as selfcontained as possible. It should in particular be accessible to physicists, who normally have no training in formal logic. We present the basics of classical propositional logic and non-monotonic logic. In fact, it is possible to provide the reader with all the logical equipment he needs in order to understand the logical invest...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 140  شماره 

صفحات  -

تاریخ انتشار 2005